Quading triangular meshes with certain topological constraints
نویسندگان
چکیده
منابع مشابه
Automatic Conversion of Triangular Meshes into Quadrilateral Meshes with Directionality
This paper presents a triangular-to-quadrilateral mesh conversion method that can control the directionality of the output quadrilateral mesh according to a user-specified vector field. Given a triangular mesh and a vector field, the method first scores all possible quadrilaterals that can be formed by pairs of adjacent triangles, according to their shape and directionality. It then converts th...
متن کاملRay Tracing Triangular Meshes
This paper describes two approaches that allow us to intersect rays with triangular meshes more quickly by amortizing computation over neighbouring triangles. The first approach accomplishes this by performing the in-out test for each triangle using three plane equations, each one representing a boundary edge for the triangle. Each plane is shared between four neighbouring triangles and the cos...
متن کاملParameterization of Triangular Meshes with Virtual Boundaries
Parameterization of a 3D triangular mesh is a fundamental problem in mesh processing, such as texture mapping, multiresolution modeling, and smooth surface fitting. The convex combination approach is widely used for parameterization because it has good properties such as fast computation and little distortion of embedded triangles. However, the approach has one drawback: most boundary triangles...
متن کاملSubdivision Curves on Triangular Meshes
Subdivision curves have great importance for many CAD/CAM applications. In this paper we propose a simple method to define subdivision schemes on triangulations. It works by translating to the triangulation a perturbation of a planar binary subdivision. To reproduce this perturbation in the surface we use both, shortest and straightest geodesics, so we call this strategy intrinsic projection me...
متن کاملComputing geodesics on triangular meshes
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian’s Fast Marching Method and Polthier’s straightest geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle both convex and non-convex surfaces. r 2005 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2011
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.05.009